const github.com/andybalholm/brotli/matchfinder.m0TableMask

10 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		m0.go#L30: 	m0TableMask = m0TableSize - 1
		m0.go#L97: 			candidate = int(table[nextHash&m0TableMask])
		m0.go#L98: 			table[nextHash&m0TableMask] = uint16(s)
		m0.go#L116: 			newCandidate := int(table[h&m0TableMask])
		m0.go#L117: 			table[h&m0TableMask] = uint16(newBase)
		m0.go#L150: 				table[m.hash(x)&m0TableMask] = uint16(i)
		m0.go#L155: 			table[m.hash(x)&m0TableMask] = uint16(base + 1)
		m0.go#L161: 		table[m.hash(x)&m0TableMask] = uint16(s - 3)
		m0.go#L162: 		table[m.hash(x>>8)&m0TableMask] = uint16(s - 2)
		m0.go#L164: 		table[prevHash&m0TableMask] = uint16(s - 1)